2 00 8 Dimension and hitting time in rapidly mixing systems
نویسنده
چکیده
We prove that if a system has superpolynomial (faster than any power law) decay of correlations then the time τ r (x, x 0) needed for a typical point x to enter for the first time a ball B(x 0 , r) centered in x 0 , with small radius r scales as the local dimension at x 0 , i.e. lim r→0 log τ r (x, x 0) − log r = d µ (x 0). This result is obtained by proving a kind of dynamical Borel-Cantelli lemma wich holds also in systems having polinomial decay of correlations.
منابع مشابه
ar X iv : 0 80 1 . 31 09 v 4 [ m at h . D S ] 2 3 M ar 2 00 9 LONG HITTING TIME , SLOW DECAY OF CORRELATIONS AND ARITHMETICAL PROPERTIES
Let τr(x, x 0) be the time needed for a point x to enter for the first time in a ball Br(x 0) centered in x 0 , with small radius r. We construct a class of translations on the two torus having particular arithmetic properties (Liou-ville components with intertwined denominators of convergents) not satisfying a logarithm law, i.e. such that for generic x, x 0 lim inf r→0 log τr(x, x 0) − log r ...
متن کاملN ov 2 00 6 Dimension and waiting time in rapidly mixing systems
We prove that if a system has superpolinomial (faster than any power law) decay of correlations then the time τ r (x, x 0) needed for a typical point x to enter for the first time in a ball B(x 0 , r) centered in x 0 , with small radius r scales as the local dimension at x 0 , i.e. lim r→0 log τ r (x, x 0) log r = d µ (x 0).
متن کاملar X iv : 0 80 1 . 31 09 v 5 [ m at h . D S ] 1 4 Ju l 2 00 9 LONG HITTING TIME , SLOW DECAY OF CORRELATIONS AND ARITHMETICAL PROPERTIES
Let τr(x, x 0) be the time needed for a point x to enter for the first time in a ball Br(x 0) centered in x 0 , with small radius r. We construct a class of translations on the two torus having particular arithmetic properties (Liou-ville components with intertwined denominators of convergents) not satisfying a logarithm law, i.e. such that for typical x, x 0 lim inf r→0 log τr(x, x 0) − log r ...
متن کاملSupplementary materials and proofs
2 Hitting times 3 2.1 Typical hitting times are large . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2.2 Exponential mixing on spatial graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 2.3 Expected hitting times degenerate to the stationary distribution . . . . . . . . . . . . . . . . 6 2.4 The case of one dimension . . . . . . . . . . . . . . . ....
متن کاملHitting Set for Hypergraphs of Low VC-dimension
We study the complexity of the Hitting Set problem in set systems (hypergraphs) that avoid certain sub-structures. In particular, we characterize the classical and parameterized complexity of the problem when the Vapnik-Chervonenkis dimension (VC-dimension) of the input is small. VC-dimension is a natural measure of complexity of set systems. Several tractable instances of Hitting Set with a ge...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008